Classes, Priorities and Fairness in Queueing Systems
نویسندگان
چکیده
Customer classification and prioritization are commonly used in many applications to provide queue preferential service. Their influence on queuing systems has been thoroughly studied from the delay distribution perspective. However, the fairness aspects, which are inherent to any preferential system and highly important to customers, have hardly been studied and not been quantified to date. In this work we use the Resource Allocation Queueing Fairness Measure (RAQFM) to analyze such systems and derive their relative fairness values. Results from analyzing and comparing systems with class priority to systems with no prioritization, show that assigning higher priority to short jobs often increases the system fairness, but not always. We also analyze the effect multiple servers have on fairness, showing that multiple servers increase the fairness of the system. Practitioners can use the derived results to weigh efficiency aspects versus fairness aspects in controlling their queueing systems. AMS 2000 Subject Classification: Primary 68M20 Secondary 60K25,90B22,90B36
منابع مشابه
Class treatment in queueing systems: discrimination and fairness aspects
Customer classification and prioritization are commonly used in applications to provide queue preferential service. Their influence on queuing systems has been thoroughly studied from the delay distribution perspective. However, the fairness aspects, which are inherent to any preferential system and highly important to customers, have hardly been studied and not been quantified to date. We use ...
متن کاملRate based call gapping with priorities and fairness between traffic classes
—This paper presents a new rate based call gapping method. The main advantage is that it provides maximal through-put, priority handling and fairness for traffic classes without queues, unlike Token Bucket which provides only the first two or Weighted Fair Queuing that uses queues. The Token Bucket is used for call gapping because it has good throughput characteristics. For this reason we prese...
متن کاملAsymptotic independence of servers' activity in queueing systems with limited resource pooling
We consider multi-class multi-server queuing systems where a subset of servers, called a server pool, may collaborate in serving jobs of a given class. The pools of servers associated with different classes may overlap, so the sharing of server resources across classes is done via a dynamic allocation policy based on a fairness criterion. We consider an asymptotic regime where the total load in...
متن کاملJoint queue length distribution of multi-class, single-server queues with preemptive priorities
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.
متن کاملHierarchical Fair Queueing
In this paper, we present a new queueing algorithm for networks, called Hierarchical Fair Queueing (HFQ). This shares the bandwidth between classes of users, and (within each class) between subclasses. HFQ provides a guaranteed share of bandwidth to each class, but bandwidth is not wasted when a class is inactive. Unlike the Link Sharing scheme of Floyd-Jacobsen, HFQ is provably fair, in that t...
متن کامل